SIAM Journal on Computing -- 1985

By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

© SIAM

SIAM Journal on Computing

Table of Contents

Available Volumes| Issue Index| View myArticles

Search This Issue

Volume 14, Issue 4, pp. 781-1072

Please Note: Electronic articles are available well in advance of the printed articles.

Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications

Greg N. Frederickson

pp. 781-798

BibTeX Abstract Full Text: PDF

Decomposing a Polygon into Simpler Components

pp. 799-817

BibTeX Abstract Full Text: PDF

A Linear-Time Algorithm for Computing $K$-Terminal Reliability in Series-Parallel Networks

A. Satyanarayana and R. Kevin Wood

pp. 818-832

BibTeX Abstract Full Text: PDF

A Depth-Universal Circuit

Stephen A. Cook and H. James Hoover

pp. 833-839

BibTeX Abstract Full Text: PDF

Searching Semisorted Tables

Helmut Alt and Kurt Mehlhorn

pp. 840-848

BibTeX Abstract Full Text: PDF

On Approximation Algorithms for # P

Larry Stockmeyer

pp. 849-861

BibTeX Abstract Full Text: PDF

An Efficient Parallel Biconnectivity Algorithm

Robert E. Tarjan and Uzi Vishkin

pp. 862-874

BibTeX Abstract Full Text: PDF

Distributed Multi-Destination Routing: The Constraints of Local Information

Jeffrey M. Jaffe

pp. 875-888

BibTeX Abstract Full Text: PDF

Finding Minimal Pass Sequences for Attribute Grammars

pp. 889-914

BibTeX Abstract Full Text: PDF

Optimum Communication Spanning Trees in Series-Parallel Networks

Ehab S. El-Mallah and Charles J. Colbourn

pp. 915-925

BibTeX Abstract Full Text: PDF

A Linear Recognition Algorithm for Cographs

D. G. Corneil, Y. Perl, and L. K. Stewart

pp. 926-934

BibTeX Abstract Full Text: PDF

Equations between Regular Terms and an Application to Process Logic

Rohit Parikh, Ashok Chandra, Joe Halpern, and Albert Meyer

pp. 935-942

BibTeX Abstract Full Text: PDF

The Pure Literal Rule and Polynomial Average Time

Paul Walton Purdom, Jr. and Cynthia A. Brown

pp. 943-953

BibTeX Abstract Full Text: PDF

Algorithmic Approaches to Setup Minimization

Ulrich Faigle, Gerhard Gierz, and Rainer Schrader

pp. 954-965

BibTeX Abstract Full Text: PDF

An Extension of Liouville's Theorem on Integration in Finite Terms

M. F. Singer, B. D. Saunders, and B. F. Caviness

pp. 966-990

BibTeX Abstract Full Text: PDF

Concurrent Probabilistic Programs, Or: How to Schedule If You Must

Sergiu Hart and Micha Sharir

pp. 991-1012

BibTeX Abstract Full Text: PDF

Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time

pp. 1013-1029

BibTeX Abstract Full Text: PDF

Probabilistic Models and Asymptotic Results for Concurrent Processing with Exclusive and Non-Exclusive Locks

pp. 1030-1051

BibTeX Abstract Full Text: PDF

The Knuth-Bendix Completion Procedure and Thue Systems

Deepak Kapur and Paliath Narendran

pp. 1052-1072

BibTeX Abstract Full Text: PDF